A note on Barnette's conjecture
نویسنده
چکیده
Barnette conjectured that each planar, bipartite, cubic, and 3-connected graph is hamiltonian. We prove that this conjecture is equivalent to the statement that there is a constant c > 0 such that each graph G of this class contains a path on at least c|V (G)| vertices.
منابع مشابه
Nonrevisiting Paths on Surfaces
AbstraeL The nonrevisiting path conjecture for polytopes, which is equivalent to the Hirsch conjecture, is open. However, for surfaces, the nonrevisiting path conjecture is known to be true for polyhedral maps on the sphere, projective plane, toms, and a Klein bottle. Barnette has provided counterexamples on the orientable surface of genus 8 and nonorientable surface of genus 16. In this note t...
متن کاملOn the Connectivity of Skeletons of Pseudomanifolds with Boundary
In this note we show that 1-skeletons and 2-skeletons of n-pseudomanifolds with full boundary are (n+1)-connected graphs and n-connected 2-complexes, respectively. This generalizes previous results due to Barnette and Woon.
متن کاملA note on Fouquet-Vanherpe’s question and Fulkerson conjecture
The excessive index of a bridgeless cubic graph $G$ is the least integer $k$, such that $G$ can be covered by $k$ perfect matchings. An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless cubic graph has excessive index at most five. Clearly, Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5, so Fouquet and Vanherpe as...
متن کاملConnectivity through bounds for the Castelnuovo-Mumford regularity
In this note we generalize and unify two results on connectivity of graphs: one by Balinsky and Barnette, one by Athanasiadis. This is done through a simple proof using commutative algebra tools. In particular we use bounds for the Castelnuovo–Mumford regularity of their Stanley–Reisner rings. As a result, if ∆ is a simplicial d-pseudomanifold and s is the largest integer such that ∆ has a miss...
متن کاملRobust Field-aligned Global Parametrization: Supplement 1, Proofs and Algorithmic Details
Torus with a single 3-5 pair. The nonexistence of a quadrangulation with a single 3-5 pair for a torus has been proved in [Barnette et al. 1971]. Remarkably, [Jucovič and Trenkler 1973] shows that for any choice of non-regular vertex valences, constrained by the formula for Euler’s characteristics, and any genus other than 1, a quadrangulation with vertices with these valences exists (if vertic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 33 شماره
صفحات -
تاریخ انتشار 2011